rotation matrix
- North America > United States > Minnesota > Hennepin County > Minneapolis (0.14)
- Europe > Italy > Tuscany > Florence (0.04)
- Oceania > Australia > Victoria > Melbourne (0.04)
- North America > United States > California > Santa Clara County > Palo Alto (0.04)
- Information Technology > Artificial Intelligence > Representation & Reasoning (1.00)
- Information Technology > Artificial Intelligence > Natural Language > Large Language Model (1.00)
- Information Technology > Artificial Intelligence > Natural Language > Chatbot (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Neural Networks > Deep Learning (1.00)
- North America > United States > Illinois > Champaign County > Urbana (0.04)
- Asia > China (0.04)
RMLR: Extending Multinomial Logistic Regression into General Geometries
Riemannian neural networks, which extend deep learning techniques to Riemannian spaces, have gained significant attention in machine learning. To better classify the manifold-valued features, researchers have started extending Euclidean multinomial logistic regression (MLR) into Riemannian manifolds. However, existing approaches suffer from limited applicability due to their strong reliance on specific geometric properties. This paper proposes a framework for designing Riemannian MLR over general geometries, referred to as RMLR. Our framework only requires minimal geometric properties, thus exhibiting broad applicability and enabling its use with a wide range of geometries.
Rotated Binary Neural Network
Binary Neural Network (BNN) shows its predominance in reducing the complexity of deep neural networks. However, it suffers severe performance degradation. One of the major impediments is the large quantization error between the full-precision weight vector and its binary vector. Previous works focus on compensating for the norm gap while leaving the angular bias hardly touched. In this paper, for the first time, we explore the influence of angular bias on the quantization error and then introduce a Rotated Binary Neural Network (RBNN), which considers the angle alignment between the full-precision weight vector and its binarized version.
From Coefficients to Directions: Rethinking Model Merging with Directional Alignment
Chen, Zhikang, Cui, Sen, Ye, Deheng, Zhang, Min, Niu, Gang, Zhang, Yu, Sugiyama, Masashi, Zhu, Tingting
Model merging has emerged as a practical paradigm for integrating multiple independently trained models into a single model without joint retraining. Previous studies have demonstrated the effectiveness of combining parameters through strategies such as parameter decomposition, coefficient optimization, and subspace learning, significantly reducing the need for expensive joint training and achieving strong empirical performance across diverse tasks. However, these approaches predominantly treat merging as a problem of parameter space decomposition or fusion coefficient optimization, while overlooking the critical role of directional information in both parameter and feature spaces. In practice, naïve merging introduces inconsistencies in dominant parameter directions and disrupts structural coherence across models, which can degrade performance. Moreover, coefficient-based optimization methods implicitly assume compatible feature-space directions across models. However, Neural Collapse indicates that class features follow structured directional patterns, which may differ across independently trained models, making coefficient optimization alone insufficient. In this work, we emphasize the importance of \emph{directional alignment} and introduce a unified geometric framework, \emph{Merging with Directional Alignment} (\method{}), which aligns directional structures consistently in both the parameter and feature spaces. Our analysis shows that directional alignment improves structural coherence, and extensive experiments across benchmarks, model scales, and task configurations further validate the effectiveness of our approach.
- Europe > United Kingdom > England > Oxfordshire > Oxford (0.04)
- Asia > Japan > Honshū > Kantō > Tokyo Metropolis Prefecture > Tokyo (0.04)
- Asia > China > Ningxia Hui Autonomous Region > Yinchuan (0.04)
- Information Technology (0.45)
- Health & Medicine > Diagnostic Medicine (0.45)
Angular Graph Fractional Fourier Transform: Theory and Application
Zhao, Feiyue, He, Yangfan, Zhang, Zhichao
Graph spectral representations are fundamental in graph signal processing, offering a rigorous framework for analyzing and processing graph-structured data. The graph fractional Fourier transform (GFRFT) extends the classical graph Fourier transform (GFT) with a fractional-order parameter, enabling flexible spectral analysis while preserving mathematical consistency. The angular graph Fourier transform (AGFT) introduces angular control via GFT eigenvector rotation; however, existing constructions fail to degenerate to the GFT at zero angle, which is a critical flaw that undermines theoretical consistency and interpretability. To resolve these complementary limitations - GFRFT's lack of angular regulation and AGFT's defective degeneracy - this study proposes an angular GFRFT (AGFRFT), a unified framework that integrates fractional-order and angular spectral analyses with theoretical rigor. A degeneracy-friendly rotation matrix family ensures exact GFT degeneration at zero angle, with two AGFRFT variants (I-AGFRFT and II-AGFRFT) defined accordingly. Rigorous theoretical analyses confirm their unitarity, invertibility, and smooth parameter dependence. Both support learnable joint parameterization of the angle and fractional order, enabling adaptive spectral processing for diverse graph signals. Extensive experiments on real-world data denoising, image denoising, and point cloud denoising demonstrate that AGFRFT outperforms GFRFT and AGFT in terms of spectral concentration, reconstruction quality, and controllable spectral manipulation, establishing a robust and flexible tool for integrated angular fractional spectral analysis in graph signal processing.
- Asia > China > Jiangsu Province > Nanjing (0.04)
- Asia > China > Shanghai > Shanghai (0.04)
- Asia > China > Hainan Province (0.04)
- (2 more...)
- Information Technology > Data Science > Data Quality > Data Transformation (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning (0.93)
- Information Technology > Sensing and Signal Processing > Image Processing (0.67)
- Research Report > New Finding (1.00)
- Research Report > Experimental Study (0.93)
Decentralized Swarm Control via SO(3) Embeddings for 3D Trajectories
Silveria, Dimitria, Cabral, Kleber, Jardine, Peter, Givigi, Sidney
SW ARM is a decentralized form of multi-agent system (MAS) that displays emergent behavior --that is, complex behaviors arising from local interactions governed by simple rules without centralized coordination [1]. Swarm agents are often robotic platforms such as uncrewed aerial vehicles (UA V s) used in various domains, including entertainment, surveillance, and defense. This paper addresses the challenge of generating stable, closed 3D formations around a fixed point for UA V s using only local position information. Such formations are relevant in dynamic capture, surveillance, and mobbing scenarios [2], and relate to applications such as lattice formation [3], encirclement [4], epitrochoidal motion [5], target enclosing [6], and other dynamic patterns [7]. Existing approaches often rely on consensus-based algorithms. For example, [8] uses consensus control and heading error compensation for 2D circular trajectories, with particle swarm optimization (PSO) applied to tune controller gains. However, this method scales poorly, lacks real-world validation, and is vulnerable to agent loss. Similarly, [9] applies consensus-based optimization for simulated circular patrolling.
- Europe > Norway > Norwegian Sea (0.24)
- North America > Canada > Ontario > Kingston (0.04)
- North America > United States (0.04)
Residual Pathway Priors for Soft Equivariance Constraints Supplementary Material Appendix Outline
In Section 7 discuss potential for negative impact. In Section B we investigate the utility of using RPP-EMLP for the policy function only on the Mujoco tasks. In Section C we detail the datasets and experimental methodology used in the paper. In principle both the policy and the value or critic function can benefit from equivariance. Here we present the training details of the models used in the paper.